Note on the size of binary Armstrong codes
نویسندگان
چکیده
We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k ≤ 1.224, while such a code is shown to exist whenever n/k ≤ 1.12. We also construct an Arm(2, n− 2, n) and Arm(2, n− 3, n) for all admissible n.
منابع مشابه
Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملConductive Polythiophene Nanoparticles Deposition on Transparent PET Substrates: Effect of Modification with Hybrid Organic-inorganic Coating (RESEARCH NOTE)
In this work, Poly(ethyleneterephthalate) (PET) substrate was treated using KOH solution and was modified using hybrid O-I coating containing PCL )polycaprolactone( as organic phase and TEOS )tetraethoxysilane( as inorganic phase. The coating was prepared through a sol-gel process and applied on the surface by dip coater. Then, electrically conducting polythiophene (PTh) nanoparticles were depo...
متن کاملEfficiency of Anti-Hourglassing Approaches in Finite Element Method (TECHNICAL NOTE)
one of the simplest numerical integration method which provides a large saving in computational efforts, is the well known one-point Gauss quadrature which is widely used for 4 nodes quadrilateral elements. On the other hand, the biggest disadvantage to one-point integration is the need to control the zero energy modes, called hourglassing modes, which arise. The efficiency of four different an...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملGeneralized Alon--Boppana Theorems and Error-Correcting Codes
In this paper we describe several theorems that give lower bounds on the second eigenvalue of any quotient of a given size of a fixed graph, G. These theorems generalize Alon-Boppana type theorems, where G is a regular (infinite) tree. When G is a hypercube, our theorems give minimum distance upper bounds on linear binary codes of a given size and information rate. Our bounds at best equal the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 71 شماره
صفحات -
تاریخ انتشار 2014